The Path Solver: A Non-Monotone Stabilization Scheme for Mixed Complementarity Problems
نویسندگان
چکیده
The Path solver is an implementation of a stabilized Newton method for the solution of the Mixed Complementarity Problem. The stabilization scheme employs a path-generation procedure which is used to construct a piecewise-linear path from the current point to the Newton point; a step length acceptance criterion and a non-monotone pathsearch are then used to choose the next iterate. The algorithm is shown to be globally convergent under assumptions which generalize those required to obtain similar results in the smooth case. Several implementation issues are discussed, and extensive computational results obtained from problems commonly found in the literature are given.
منابع مشابه
Robust Solution of Mixed Complementarity Problems
Robust Solution of Mixed Complementarity Problems Steven P Dirkse Under the Supervision of Associate Professor Michael C Ferris at the University of Wisconsin Madison This thesis is concerned with algorithms and software for the solution of the Mixed Complementarity Problem or MCP The MCP formulation is useful for expressing systems of nonlinear inequalities and equations the complementarity al...
متن کاملQPCOMP: A quadratic programming based solver for mixed complementarity problems
QPCOMP is an extremely robust algorithm for solving mixed nonlinear complementarity problems that has fast local convergence behavior. Based in part on the NE/SQP method of Pang and Gabriell14], this algorithm represents a signiicant advance in robustness at no cost in eeciency. In particular, the algorithm is shown to solve any solvable Lipschitz continuous, continuously diierentiable, pseudo-...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملMathematical Programming Manuscript No. Feasible Descent Algorithms for Mixed Complementarity Problems
In this paper we consider a general algorithmic framework for solving nonlinear mixed complementarity problems. The main features of this framework are: (a) it is well-deened for an arbitrary mixed complementarity problem, (b) it generates only feasible iterates, (c) it has a strong global convergence theory, and (d) it is locally fast convergent under standard regularity assumptions. This fram...
متن کاملFeasible descent algorithms for mixed complementarity problems
In this paper we consider a general algorithmic framework for solving nonlinear mixed complementarity problems. The main features of this framework are: (a) it is well-defined for an arbitrary mixed complementarity problem, (b) it generates only feasible iterates, (c) it has a strong global convergence theory, and (d) it is locally fast convergent under standard regularity assumptions. This fra...
متن کامل